Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
231	Journal of Artificial Intelligence Research Submitted 07/10; publishedA Monte-Carlo AIXI Approximation Joel Veness Add to Reading List Source URL: www.jair.org Language: English - Date: 2011-01-24 13:03:15 Algorithm Machine learning Marcus Hutter Reinforcement learning
232	Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:07:07 Lepidoptera Polynomials Tree decomposition Approximation algorithm Caterpillar Polylogarithmic Theoretical computer science Graph theory Mathematics
233	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
234	Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2011-09-29 14:25:56 Operations research Combinatorial optimization Relaxation Convex optimization Linear programming relaxation Linear programming Knapsack problem Randomized algorithm Lagrangian relaxation Mathematical optimization Theoretical computer science Applied mathematics
235	An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-08-11 23:51:43 Tree Graph coloring Minor Path decomposition Planar separator theorem Graph theory Graph operations Planar graph
236	Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2012-11-25 12:04:59 Submodular set function Order theory Matroid Linear programming Greedy algorithm XTR Monotonic function Greedoid Ordinal optimization Mathematics Mathematical analysis Matroid theory
237	A 2.5 Factor Approximation Algorithm for the k-MST Problem Sunil Arya∗ H. Ramesh† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:31:23 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Tree Graph Approximation algorithm Steiner tree problem Theoretical computer science Graph theory Mathematics
238	Syntactic Characterizations of Polynomial Time Optimization Classes Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-07-07 17:48:07 Computational problems Computational complexity theory Operations research Optimization problem Mathematical optimization Approximation algorithm NP Decision problem Polynomial-time approximation scheme Theoretical computer science Applied mathematics Complexity classes
239	International Journal of Computational Geometry & Applications c World Scientific Publishing Company APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING∗ Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:37:23 Milling machine Manufacturing Metalworking terminology Woodworking Speeds and feeds Numerical control Cutting tool Milling cutter Metalworking Technology Machining
240	Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the diﬀerent versions are combined into one Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-02 09:14:39 Uriel Feige NP-complete problems Computational complexity theory Adi Shamir Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Symposium on Foundations of Computer Science Approximation algorithm Uriel Theoretical computer science Applied mathematics Mathematics

UPDATE